Well-quasi-ordering and the Hausdorff quasi-uniformity
نویسندگان
چکیده
منابع مشابه
The bicompletion of the Hausdorff quasi-uniformity
We study conditions under which the Hausdorff quasi-uniformity UH of a quasi-uniform space (X,U) on the set P0(X) of the nonempty subsets of X is bicomplete. Indeed we present an explicit method to construct the bicompletion of the T0-quotient of the Hausdorff quasi-uniformity of a quasi-uniform space. It is used to find a characterization of those quasi-uniform T0spaces (X,U) for which the Hau...
متن کاملSubgraphs and well-quasi-ordering
Let % be a class of graphs and let i be the subgraph or the induced subgraph relation. We call % an idea/ (with respect to I) if G I G' E % implies that G E %. In this paper, we study the ideals that are well-quasiordered by I. The following are our main results. If 5 is the subgraph relation, we characterize the well-quasi-ordered ideals in terms of excluding subgraphs. If I is the induced sub...
متن کاملInduced minors and well-quasi-ordering
A graph H is an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-induced minor-free. Robin Thomas showed that K4-induced minor-free graphs are well-quasi-ordered by induced minors [Graphs without K4 and well-quasi-ordering, Journal of Combinatorial Theory, Series B, 38(3):240 – 247, 1985]. We provide a dichotomy th...
متن کاملWell-Quasi-Ordering, Overview and its Applications
This talk shows theorems, techniques, and applications of well-quasi-ordering (WQO). First, we introduce what is WQO, and Kruskaltype theorems on various data structures [31, 15, 16, 23, 34, 33]. The basic proof technique, minimal bad sequence (MBS), will be introduced for the simplest case, Higman’s Lemma. Then, WQO will be extended to better-quasi-ordering (BQO) for infinite data structures [...
متن کاملRank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle (2002) proved that binary matroids of bounded branch-width are well-quasi-ordered by the matroid minor relation. We prove another theorem of this kind in terms of rank-width and vertex-minors. For a graph G = (V,E) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1998
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(97)00151-x